#include<iostream>
#include<string>
using namespace std;
const int N = 1010;
typedef long long ll;
int a[N][N];
ll s[N][N];   //前缀和数组
int main()
{
    int n, m;
    ll q;
    cin >> n >> m>>q;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j];
    //计算二维前缀和
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            s[i][j] = s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1] + a[i][j];     //左+上-左上+自己
    //计算子矩阵和
    while (q--)
    {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        cout << s[x2][y2] - s[x2][y1 - 1] - s[x1 - 1][y2] + s[x1 - 1][y1 - 1] << endl; //大-小（计算小的，左上角重复计算两次）
    }
    return 0;
}